Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV)

نویسندگان

  • Luca Maria Gambardella
  • Silvano Martello
چکیده

This special issue of European Journal of Operational Research is devoted to the ECCO XV Conference, the fifteen annual meeting of the European Chapter on Combinatorial Optimization, held at the University of Lugano (Switzerland), from May 30 to June 1, 2002. ECCO, the EURO Working Group on Combinatorial Optimization, was created in 1987 by C. Roucairol, D. De Werra and A. Rinnooy Kan. It provides an excellent opportunity to discuss recent and important issues in combinatorial optimization and its applications. The group, which has about 500 members, is open to everybody interested in the field, either in theoretical aspects or in business, industry or public administration applications. During the first ten years, Catherine Roucairol (Université de Versailles, France) coordinated the ECCO activities. The current coordinator is Silvano Martello (University of Bologna, Italy). The ECCO meetings are held on a regular basis (once a year during Spring) and are devoted to all aspects of combinatorial optimization: operations management and logistics, production scheduling, location and distribution problems, resource allocation, flexible manufacturing, scheduling, VLSI design and computer design, network optimization, etc. Recently, special sessions in ECCO meetings put particular emphasis on new local search methods (tabu, genetic algorithms, simulated annealing), polyhedra approaches to difficult problems and recent developments in classical optimization problems (such as scheduling, assignment, knapsack, partitioning, etc). At ECCO meetings usually about 100 participants nicely combine scientific works and exchange of new ideas with an exciting atmosphere like Paris (May 1988), Venice (June 1989), Barcelona (May 1990), Dubrovnik (May 1991, canceled due to the unstable political situation in Croatia), Graz (April 1992), Bruxelles (April 1993), Milano (February 1994), Poznan (May 1995), Dublin (April 1996), Tenerife (May 1997), Copenhagen (May 1998), Bendor (May 1999), Capri (May 2000), Bonn (2001), Lugano (2002), Molde (2003), Beirut (2004). The Scientific Program Committee for ECCO XV was formed by Jacek BÃlażewicz (Technical University of Poznan, Poland), Van-Dat Cung (Univer-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consensus-Based Decentralized Auctions for Robust Task Allocation Citation

This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., the consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection and use a c...

متن کامل

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

Cuckoo hashing is a highly practical dynamic dictionary: it provides amortized constant insertion time, worst case constant deletion time and lookup time, and good memory utilization. However, with a noticeable probability during the insertion of n elements some insertion requires Ω(log n) time. Whereas such an amortized guarantee may be suitable for some applications, in other applications (su...

متن کامل

New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center

Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....

متن کامل

Succinct Sampling on Streams

A streaming model is one where data items arrive over long period of time, either one item at a time or in bursts. Typical tasks include computing various statistics over a sliding window of some fixed time horizon. What makes the streaming model interesting is that as the time progresses, old items expire and new ones arrive. One of the simplest and most central tasks in this model is sampling...

متن کامل

Provable algorithms for parallel generalized sweep scheduling

We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh from multiple directions. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 166  شماره 

صفحات  -

تاریخ انتشار 2005